package 草稿包;

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class test3 {
    public static void main(String[] args) {
//        Scanner in=new Scanner(System.in);
//        String str=in.nextLine();
        // System.out.println(str);

        String str="abcd12345ed125ss123";

        int max=-1;
        StringBuilder ans=new StringBuilder();
        StringBuilder tmp=new StringBuilder();
        for(int i=1;i<str.length();i++){
            if(Character.isDigit(str.charAt(i))&&str.charAt(i)-str.charAt(i-1)==1){
                tmp.append(str.charAt(i-1));
                if(i==str.length()-1)tmp.append(str.charAt(i));
            }else{
                // System.out.println(str.charAt(i)+"-"+str.charAt(i-1));
                tmp.append(str.charAt(i-1));
                //结束了，就进行判断保存和清空
                if(tmp.length()>max){
                    // System.out.println(tmp.length()+":"+max);
                    // System.out.println(tmp+":"+ans);

                    max=tmp.length();
                    ans=new StringBuilder(tmp);
                    // System.out.println(ans);
                }
                tmp.setLength(0);
            }
        }
        if(tmp.length()>max){
            ans=new StringBuilder(tmp);
        }
        System.out.println(ans.toString());
        Scanner in=new Scanner(System.in);
        int cnt=0;
        int n=in.nextInt();
        int[] q=new int[n];
        Map<Integer,Integer> mp=new HashMap<>();
        for(int i=0;i<n;i++){
            q[i]=in.nextInt();
            Integer integer = mp.get(q[i]);
            mp.put(q[i],1);
        }
        mp.forEach((k,v)->{
        });
    }
}
